منابع مشابه
Some New Results on Sum Divisor Cordial Graphs
Abstract. A sum divisor cordial labeling of a graph G with vertex set V is a bijection f from V to {1,2,...,| ( ) |} V G such that each edge uv assigned the label 1 if 2 divides ( ) ( ) f u f v + and 0 otherwise. Further, the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph with a sum divisor cordial labeling is called a sum divisor cordial grap...
متن کاملDuplication and Switching of Divisor Cordial Graphs
A divisor cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2, 3, . . .,|V|} such that if an edge uv is assigned the label 1 if f(u) divides f(v) or f(v) divides f(u) and 0 otherwise, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. If a graph has a divisor cordial labeling, then it is called divisor cordial graph. ...
متن کاملSome Star and Bistar Related Divisor Cordial Graphs
A divisor cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2,... | |} V such that an edge uv is assigned the label 1 if either ( ) | ( ) f u f v or ( ) | ( ) f v f u and the label 0 if ( ) ( ) f u f v , then number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph with a divisor cordial labeling is called a divisor cordial ...
متن کاملFurther Results on Divisor Cordial Labeling
Abstract. A divisor cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2,... | |} V such that an edge uv is assigned the label 1 if ( ) | ( ) f u f v or ( ) | ( ) f v f u and the label 0 otherwise, then number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph with a divisor cordial labeling is called a divisor cordial graph. ...
متن کاملSome New Families of Divisor Cordial Graph
A divisor cordial labeling of a graph G with vertex set V vertex G is a bijection f from V to {1, 2, 3, . . . |V|} such that an edge uv is assigned the label 1 if f(u) divides f(v) or f(v)divides f(u) and 0 otherwise, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. If a graph has a divisor cordial labeling, then it is called divisor cordial gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proyecciones (Antofagasta)
سال: 2016
ISSN: 0716-0917
DOI: 10.4067/s0716-09172016000100008